DYNAMIC CHARACTERISTICS OF SPACE STRUCTURE
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولA Dynamic Structure of Social Trait Space.
Facial appearance evokes robust impressions of other people's personality traits. Recent research suggests that the trait space arising from face-based impressions shifts due to context and social cognitive factors. We suggest a novel framework in which multiple bottom-up and top-down processes mutually determine a dynamic rather than fixed trait space.
متن کاملCoupled BE-FE Scheme for Three-Dimensional Dynamic Interaction of a Transversely Isotropic Half-Space with a Flexible Structure
The response of structures bonded to the surface of a transversely isotropic half-space (TIHS) under the effect of time-harmonic forces is investigated using a coupled FE-BE scheme. To achieve this end, a Finite Element program has been developed for frequency domain analysis of 3D structures, as the first step. The half-space underlying the structure is taken into consideration using a Boundar...
متن کاملThe Wijsman structure of a quantale-valued metric space
We define and study a quantale-valued Wijsman structure on the hyperspace of all non-empty closed sets of a quantale-valued metric space. We show its admissibility and that the metrical coreflection coincides with the quantale-valued Hausdorff metric and that, for a metric space, the topological coreflection coincides with the classical Wijsman topology. We further define an index of compactnes...
متن کاملFully Dynamic Data Structure for LCE Queries in Compressed Space
A Longest Common Extension (LCE) query on a text T of length N asks for the length of the longest common prefix of suffixes starting at given two positions. We show that the signature encoding G of size w = O(min(z log N log∗M, N)) [Mehlhorn et al., Algorithmica 17(2):183198, 1997] of T , which can be seen as a compressed representation of T , has a capability to support LCE queries in O(log N ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Architectural Institute of Japan
سال: 1968
ISSN: 0387-1185,2433-0027
DOI: 10.3130/aijsaxx.149.0_41